4 Kolmogorov Complexity
نویسنده
چکیده
One can prove X1 is not regular using the pumping lemma. One can prove X2 is not regular either by using the pumping lemma (a version with bounds on the prefix) or by contradiction: if X2 is regular than X2 ∩ a∗b∗ = X1 is regular. One cannot prove X3 non-regular with the pumping theorem directly; however one can prove its regular by contradiction: if X3 is regular than X3 = X2 is regular. We will view the proofs by contradiction as reductions.
منابع مشابه
Title Kolmogorov Complexity Estimation and Analysis
Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using Lempel Ziv 78 Universal compression algorithm to estimate complexity is introduced. 1 Abstract—Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using ...
متن کاملLogical operations and Kolmogorov complexity
Conditional Kolmogorov complexity can be understood as the complexity of the problem “ ”, where is the problem “construct ” and is the problem “construct ”. Other logical operations ( ) can be interpreted in a similar way, extending Kolmogorov interpretation of intuitionistic logic and Kleene realizability. This leads to interesting problems in algorithmic information theory. Some of these ques...
متن کاملIs Randomness native to Computer Science? Ten Years Later
2 What we have learned? A personal pick 4 2.1 From randomness to complexity . . . . . . . . . . . . . . . . . . . . . 4 2.2 Formalization of randomness: infinite strings . . . . . . . . . . . . . 5 2.3 Random versus lawless . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.4 Randomness and finite strings: incompressibility . . . . . . . . . . . 7 2.5 Representation and Kolmogorov complexi...
متن کاملA High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law
It is shown that the 0-1 Law for recursive logics on nite structures admits an equivalent formulation in terms of Kolmogorov complexity. The new formulation opens the possibility of using the Kolmogorov complexity apparatus to easily derive various properties for nite structures satisfying a given properties. Examples that illustrate this point are provided.
متن کاملShannon Entropy vs. Kolmogorov Complexity
Most assertions involving Shannon entropy have their Kolmogorov complexity counterparts. A general theorem of Romashchenko [4] states that every information inequality that is valid in Shannon’s theory is also valid in Kolmogorov’s theory, and vice verse. In this paper we prove that this is no longer true for ∀∃-assertions, exhibiting the first example where the formal analogy between Shannon e...
متن کاملComplicated Complementations
Kolmogorov complexity has proven to be a very useful tool in simplifying and improving proofs that use complicated combinatorial arguments. In this paper we use Kolmogorov complexity for oracle construction. We obtain separation results that are much stronger than separations obtained previously even with the use of very complicated combinatorial arguments. Moreover the use of Kolmogorov argume...
متن کامل